On a Min-max Theorem of Cacti
نویسنده
چکیده
A simple proof is presented for the min-max theorem of Lovv asz on cacti. Instead of using the result of Lovv asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem.
منابع مشابه
Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملA note on the zeroth-order general randić index of cacti and polyomino chains
The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملOn my Min-Max Theorem (1968) and its consequences
Central to the origins of my operator trigonometry, a theory in which I initiated the concepts of antieigenvalues and antieigenvectors, is my 1968 Min-Max Theorem. I will discuss its motivation, proof, and consequences. Special emphasis will be given here to a new view that sin φ(A) may be viewed as a general optimum which encompasses many other optima of individual interest. 1. The application...
متن کاملApplications of the Gaussian Min-Max theorem
We show how the Gaussian min-max theorem provides direct proofs of several famous results in asymptotic geometric analysis, such as, the Dvoretzky theorem, the Johnson-Lindenstrauss Lemma, Gluskin’s theorem on embedding in `1 , and others.
متن کامل